package Classic150;

public class 搜索旋转排序数组 {
    /*
        分类讨论
     */
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) return mid;
            if (target >= nums[0]) {
                if (nums[mid] < target && nums[mid] >= nums[0]) left = mid + 1;
                else right = mid - 1;
            } else {
                if (nums[mid] > target && nums[mid] < nums[0]) right = mid - 1;
                else left = mid + 1;
            }
        }
        return -1;
    }
}
